<title>「SCOI2005」互不侵犯</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cp">#include</span><span class="pl-cpf">&lt;cstdio&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;iostream&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;cstring&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;cmath&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;string&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;algorithm&gt;</span><span class="pl-cp"></span>
<span class="pl-k">using</span> <span class="pl-k">namespace</span> <span class="pl-n">std</span><span class="pl-p">;</span>
<span class="pl-kt">int</span> <span class="pl-n">sit</span><span class="pl-p">[</span><span class="pl-mi">2000</span><span class="pl-p">],</span><span class="pl-n">gs</span><span class="pl-p">[</span><span class="pl-mi">2000</span><span class="pl-p">];</span>
<span class="pl-kt">int</span> <span class="pl-n">cnt</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-kt">int</span> <span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-n">yong</span><span class="pl-p">;</span>
<span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-mi">10</span><span class="pl-p">][</span><span class="pl-mi">2000</span><span class="pl-p">][</span><span class="pl-mi">100</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-p">{</span><span class="pl-mi">0</span><span class="pl-p">};</span>
<span class="pl-kt">void</span> <span class="pl-nf">dfs</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">he</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">sum</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">node</span><span class="pl-p">){</span>
    <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">node</span><span class="pl-o">&gt;=</span><span class="pl-n">n</span><span class="pl-p">){</span>
        <span class="pl-n">sit</span><span class="pl-p">[</span><span class="pl-o">++</span><span class="pl-n">cnt</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">he</span><span class="pl-p">;</span>
        <span class="pl-n">gs</span><span class="pl-p">[</span><span class="pl-n">cnt</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">sum</span><span class="pl-p">;</span>
        <span class="pl-k">return</span><span class="pl-p">;</span>
    <span class="pl-p">}</span>
    <span class="pl-n">dfs</span><span class="pl-p">(</span><span class="pl-n">he</span><span class="pl-p">,</span><span class="pl-n">sum</span><span class="pl-p">,</span><span class="pl-n">node</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">);</span>
    <span class="pl-n">dfs</span><span class="pl-p">(</span><span class="pl-n">he</span><span class="pl-o">+</span><span class="pl-p">(</span><span class="pl-mi">1</span><span class="pl-o">&lt;&lt;</span><span class="pl-n">node</span><span class="pl-p">),</span><span class="pl-n">sum</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">node</span><span class="pl-o">+</span><span class="pl-mi">2</span><span class="pl-p">);</span>
<span class="pl-p">}</span>
<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">(){</span>
    <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">yong</span><span class="pl-p">);</span>
    <span class="pl-n">dfs</span><span class="pl-p">(</span><span class="pl-mi">0</span><span class="pl-p">,</span><span class="pl-mi">0</span><span class="pl-p">,</span><span class="pl-mi">0</span><span class="pl-p">);</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">cnt</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-mi">1</span><span class="pl-p">][</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-n">gs</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]]</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">2</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span>
        <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">j</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">j</span><span class="pl-o">&lt;=</span><span class="pl-n">cnt</span><span class="pl-p">;</span><span class="pl-n">j</span><span class="pl-o">++</span><span class="pl-p">)</span>
            <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">k</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">k</span><span class="pl-o">&lt;=</span><span class="pl-n">cnt</span><span class="pl-p">;</span><span class="pl-n">k</span><span class="pl-o">++</span><span class="pl-p">){</span>
                <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">sit</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-p">]</span><span class="pl-o">&amp;</span><span class="pl-n">sit</span><span class="pl-p">[</span><span class="pl-n">k</span><span class="pl-p">])</span><span class="pl-k">continue</span><span class="pl-p">;</span>
                <span class="pl-k">if</span><span class="pl-p">((</span><span class="pl-n">sit</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-p">]</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-p">)</span><span class="pl-o">&amp;</span><span class="pl-n">sit</span><span class="pl-p">[</span><span class="pl-n">k</span><span class="pl-p">])</span><span class="pl-k">continue</span><span class="pl-p">;</span>
                <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">sit</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-p">]</span><span class="pl-o">&amp;</span><span class="pl-p">(</span><span class="pl-n">sit</span><span class="pl-p">[</span><span class="pl-n">k</span><span class="pl-p">]</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-p">))</span><span class="pl-k">continue</span><span class="pl-p">;</span>
                <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">s</span><span class="pl-o">=</span><span class="pl-n">yong</span><span class="pl-p">;</span><span class="pl-n">s</span><span class="pl-o">&gt;=</span><span class="pl-n">gs</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-p">];</span><span class="pl-n">s</span><span class="pl-o">--</span><span class="pl-p">)</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-n">j</span><span class="pl-p">][</span><span class="pl-n">s</span><span class="pl-p">]</span><span class="pl-o">+=</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-o">-</span><span class="pl-mi">1</span><span class="pl-p">][</span><span class="pl-n">k</span><span class="pl-p">][</span><span class="pl-n">s</span><span class="pl-o">-</span><span class="pl-n">gs</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-p">]];</span>
            <span class="pl-p">}</span>
    <span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">ans</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">cnt</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span><span class="pl-n">ans</span><span class="pl-o">+=</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">n</span><span class="pl-p">][</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-n">yong</span><span class="pl-p">];</span>
    <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%lld&quot;</span><span class="pl-p">,</span><span class="pl-n">ans</span><span class="pl-p">);</span>
    <span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>